Intuitionistic Validity in T-Normal Kripke Structures
نویسنده
چکیده
Let T be a first-order theory. A T -normal Kripke structure is one in which every world is a classical model of T . This paper gives a characterization of the intuitionistic theory HT of sentences intuitionistically valid (forced) in all T -normal Kripke structures and proves the corresponding soundness and completeness theorems. For Peano arithmetic (PA), the theory HPA is a proper subtheory of Heyting arithmetic (HA), so HA is complete but not sound for PA-normal Kripke structures.
منابع مشابه
Canonical Kripke Models and the Intuitionistic Semantics of Logic Programs
Motivated by the problem of extending stable semantics (SS) and well-founded semantics (WFS) while avoiding their drawbacks, we propose a new simple and intuitive semantics for (normal) logic programs, called canonical Kripke model semantics. Our approach is based on formulating stability in an intuitionistic framework which helps us overcome several drawbacks. As a consequence, every normal pr...
متن کاملBisimulation and Propositional Intuitionistic Logic
The Brouwer-Heyting-Kolmogorov interpretation of intuition-istic logic suggests that p q can be interpreted as a computation that given a proof of p constructs a proof of q. Dually, we show that every nite canonical model of q contains a nite canonical model of p. If q and p are interderivable, their canonical models contain each other. Using this insight, we are able to characterize validity i...
متن کاملAn Interactive Prover for Bi-intuitionistic Logic
In this paper we present an interactive prover for deciding formulas in propositional bi-intuitionistic logic (BiInt). This tool is based on a recent connection-based characterization of bi-intuitionistic validity through bi-intuitionistic resource graphs (biRG). After giving the main concepts and principles we illustrate how to use this interactive proof or counter-model building assistant and...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملKripke Models, Distributive Lattices, and Medvedev Degrees
We define a variant of the standard Kripke semantics for intuitionistic logic, motivated by the connection between constructive logic and the Medvedev lattice. We show that while the new semantics is still complete, it gives a simple and direct correspondence between Kripke models and algebraic structures such as factors of the Medvedev lattice.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 59 شماره
صفحات -
تاریخ انتشار 1993